Apparatus and method for generating a token certificate associated with an assignment

ABSTRACT

An apparatus and method for generating an NFT associated with an assignment. An assignment is completed and an indication of the completion of the assignment is submitted to a processor. The processor verifies the completion of the assignment by processing the submitted evidence of the completion of the assignment. An NFT is generated that is associated with the completion of the assignment. The NFT may be associated with the user that completed the assignment.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of Non-provisional Application No. 17/872,254, filed on Jul. 25, 2022, and entitled “APPARATUS AND METHOD FOR GENERATING A TOKEN CERTIFICATE ASSOCIATED WITH AN ASSIGNMENT,” the entirety of which is incorporated herein by reference.

FIELD OF THE INVENTION

The present invention generally relates to the field of cryptography. In particular, the present invention is directed to an apparatus and method for generating a nonfungible token associated with an activity.

BACKGROUND

NFTs are used as certificates. There is a need to generate token certificates to certify authenticity of a person's achievements and completed objectives.

SUMMARY OF THE DISCLOSURE

In an aspect, an apparatus for generating a token certificate associated with an assignment is described. The apparatus includes at least a processor and a memory communicatively connected to the at least a processor, the memory containing instructions configuring the at least a processor to receive an indication of a completion of an assignment related to a user. The memory containing instructions further configuring the at least a processor to verify the completion of the assignment related to the user using an image processing module. The memory containing instructions further configuring the at least a processor to generate a token certificate as a function of the completion of the assignment, wherein generating the token certificate includes retrieving a user identifier and generating the token certificate as a function of the user identifier.

In another aspect, a method for generating a token certificate associated with an assignment is described. The method includes receiving, by at least a processor, an indication of completion of an assignment related to a user. The method further including verifying, by the at least a processor, the completion of the assignment related to the user using an image processing module. The method further including generating, by the at least a processor, a token certificate as a function of the completion of the assignment, wherein generating the token certificate includes retrieving a user identifier and generating the token certificate as a function of the user identifier.

These and other aspects and features of non-limiting embodiments of the present invention will become apparent to those skilled in the art upon review of the following description of specific non-limiting embodiments of the invention in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

For the purpose of illustrating the invention, the drawings show aspects of one or more embodiments of the invention. However, it should be understood that the present invention is not limited to the precise arrangements and instrumentalities shown in the drawings, wherein:

FIG. 1 is a block diagram of an apparatus for generating a token certificate;

FIG. 2 is an exemplary embodiment of an immutable sequential listing;

FIG. 3 is an exemplary embodiment of a neural network;

FIG. 4 is an exemplary embodiment of a node of a neural network;

FIG. 5 is an exemplary embodiment of a machine-learning module;

FIG. 6 is a flow diagram of a method for generating a token certificate associated with an assignment;

FIG. 7 is a block diagram of a computing system that can be used to implement any one or more of the methodologies disclosed herein and any one or more portions thereof.

The drawings are not necessarily to scale and may be illustrated by phantom lines, diagrammatic representations, and fragmentary views. In certain instances, details that are not necessary for an understanding of the embodiments or that render other details difficult to perceive may have been omitted.

DETAILED DESCRIPTION

At a high level, aspects of the present disclosure are directed to apparatus and method for generating a token certificate associated with an assignment. Aspects of the present disclosure can be used to verify the status of an assignment, which may include determining the completeness of an assignment. Aspects of the present disclosure can also be used to generate a token certificate as a function of the completion of an assignment. Exemplary embodiments illustrating aspects of the present disclosure are described below in the context of several specific examples.

Referring now to FIG. 1 , an exemplary embodiment of an apparatus 100 for generating a nonfungible token associated with an assignment is illustrated. Apparatus 100 includes a processor 104. Processor 104 may include any computing device as described in this disclosure, including without limitation a microcontroller, microprocessor, digital signal processor (DSP) and/or system on a chip (SoC) as described in this disclosure. Computing device may include, be included in, and/or communicate with a mobile device such as a mobile telephone or smartphone. Processor 104 may include a single computing device operating independently, or may include two or more computing device operating in concert, in parallel, sequentially or the like; two or more computing devices may be included together in a single computing device or in two or more computing devices. Processor 104 may interface or communicate with one or more additional devices as described below in further detail via a network interface device. Network interface device may be utilized for connecting Processor 104 to one or more of a variety of networks, and one or more devices. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software etc.) may be communicated to and/or from a computer and/or a computing device. Processor 104 may include but is not limited to, for example, a computing device or cluster of computing devices in a first location and a second computing device or cluster of computing devices in a second location. Processor 104 may include one or more computing devices dedicated to data storage, security, distribution of traffic for load balancing, and the like. Processor 104 may distribute one or more computing tasks as described below across a plurality of computing devices of computing device, which may operate in parallel, in series, redundantly, or in any other manner used for distribution of tasks or memory between computing devices. Processor 104 may be implemented using a “shared nothing” architecture in which data is cached at the worker, in an embodiment, this may enable scalability of system 100 and/or computing device.

With continued reference to FIG. 1 , processor 104 may be designed and/or configured to perform any method, method step, or sequence of method steps in any embodiment described in this disclosure, in any order and with any degree of repetition. For instance, Processor 104 may be configured to perform a single step or sequence repeatedly until a desired or commanded outcome is achieved; repetition of a step or a sequence of steps may be performed iteratively and/or recursively using outputs of previous repetitions as inputs to subsequent repetitions, aggregating inputs and/or outputs of repetitions to produce an aggregate result, reduction or decrement of one or more variables such as global variables, and/or division of a larger processing task into a set of iteratively addressed smaller processing tasks. Processor 104 may perform any step or sequence of steps as described in this disclosure in parallel, such as simultaneously and/or substantially simultaneously performing a step two or more times using two or more parallel threads, processor cores, or the like; division of tasks between parallel threads and/or processes may be performed according to any protocol suitable for division of tasks between iterations. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various ways in which steps, sequences of steps, processing tasks, and/or data may be subdivided, shared, or otherwise dealt with using iteration, recursion, and/or parallel processing.

Continuing to reference FIG. 1 , apparatus 100 receives an indication of a completion of an assignment 108. An “assignment,” as used herein, is an activity that a user has done/completed. For example, an assignment 108 may include accomplished objectives, missions, mastered skills, or the like. As used herein, an “objective” is a goal. A mission may be a virtual mission, such as completing a mission on a game or it may be a non-virtual mission, such as one that requires attendance of a real-life class. The game may include a virtual living room, wherein a user 112 may go around and “cancel” monthly bills, such as subscription services. In another embodiment, assignment 108 may include an objective such as overcoming stage fright. A user 112, such as a child, may want to be an actor, but has a weakness of stage fright. An objective may include overcoming stage fright and achieving that objective may include attending weekly sessions of TOASTMASTERS. In another embodiment, assignment 108 may include a mastered skill such as learning how to tie your shoelaces. An indication of a completion of an assignment 108 may include a certificate indicating the completion of a course, such as TOASTMASTERS, a report card for the end of the year, a demonstration of a mastered skill, and the like. An indication of completion of an assignment 108 may be received by any form of electronic communication and/or manual entry, including without limitation email, dropbox, Bluetooth, AirDrop, or the like.

Continuing to reference FIG. 1 and in an embodiment, objectives may be set by an inner circle member 116. Assignment 108 may also be set by an inner circle member 116. As used herein, an “inner circle member” is a person with direct knowledge of the assignment/objective. An inner circle member 116 may decide on a user 112 to use apparatus 100. An inner circle member 116 may include parents, supervisors, validators, coaches, people of authority, or the like. Inner circle member 116 may be related to the activity. For example, the teacher of a TOASTMASTERS class may be an inner circle member 116 if the assignment is to improve speaking skills. User 112 may include children, students, employees, or the like. An inner circle member 116 may determine weaknesses of a user 112 and set assignments/objectives to address those weaknesses. An inner circle member 116 may set assignments to develop a user's strength. Alternatively or additionally, an inner circle member 116 may be determined and selected by user 112.

Continuing to reference FIG. 1 , completion of an assignment 108 may include a submission of evidence 120 to processor 104. In an embodiment, upon completion of an assignment 108, a user 112 may upload evidence such as input image data to processor 104 showing that assignment 108 is complete. Input image data may be captured by an image capture device such as a camera, scanner, or the like. In an embodiment, an input image data may include a picture of a certificate showing completion of a course, such as a TOASTMASTERS course. In another embodiment, an input image data may show a successfully tied shoe. In another embodiment, input image data may show a completed ‘level’ in a game. In yet another embodiment, input image data may include a written testimony indicating that an assignment is complete. For example, a testimony may be provided by a teacher of a child to attest to the fact that the child (user 112) has improved their math skills. Additionally, or alternatively, evidence 120 showing an indication of completion of an assignment 108 may include audio. For example, audio may show a complete run through of a piece of music that a user 112 has been practicing. Audio may be captured using a microphone, or the like.

A “sensing device” as used in this disclosure is a device that detects natural one or more physical and/or energetic signals and/or phenomena and converts one or more physical and/or energetic signals and/or phenomena into electronic signals. Sensing device 104 may include, but is not limited to, cameras, infrared sensors, lidar sensor, radar sensors, photodetectors, vibration and/or audio sensors, temperature sensors, sensors of electrical phenomena, electromagnetic phenomena, or the like, force, load, pressure, and/or displacement sensors, any component or device that transduces physical and/or energetic signals and/or phenomena into electric signals, or any homogeneous or heterogeneous combination of any of the above into arrays, batteries, or the like. In some embodiments, sensing device 104 may include one or more depth sensors. Sensing device 104 may be in electronic communication with apparatus 100. “Electronic communication” as used throughout this disclosure is a form of data connection between two or more devices. Sensing device 104 may transmit optical data 108 to apparatus 100. “Optical data” as used throughout this disclosure is data obtained by and/or derived from, capture of light emitted, reflected, and/or refracted from, off, or through objects exterior to a sensing device. “Visual elements” as used in this disclosure are elements of data relating to sight. Visual elements may include, without limitation, color, motion, contrast, sharpness, and the like. Optical data 108 may include data such as, but not limited to, exposure, color, contrast, brightness, sharpness, motion, depth, and the like thereof. Optical data 108 may include information of one or more parts of a surrounding environment of sensing device 104 and/or apparatus 100. Still referring to FIG. 1 , as used in this disclosure, a “camera” is a device that is configured to sense electromagnetic radiation, such as without limitation visible light, and generate an image representing the electromagnetic radiation. In some cases, a camera may include one or more optics. Exemplary non-limiting optics include spherical lenses, aspherical lenses, reflectors, polarizers, filters, windows, aperture stops, and the like. In some cases, at least a camera may include an image sensor. Exemplary non-limiting image sensors include digital image sensors, such as without limitation charge-coupled device (CCD) sensors and complimentary metal-oxide-semiconductor (CMOS) sensors, chemical image sensors, and analog image sensors, such as without limitation film. In some cases, a camera may be sensitive within a non-visible range of electromagnetic radiation, such as without limitation infrared. As used in this disclosure, “image data” is information representing at least a physical scene, space, and/or object. In some cases, image data may be generated by a camera. “Image data” may be used interchangeably through this disclosure with “image,” where image is used as a noun. An image may be optical, such as without limitation where at least an optic is used to generate an image of an object. An image may be material, such as without limitation when film is used to capture an image. An image may be digital, such as without limitation when represented as a bitmap. Alternatively, an image may be comprised of any media capable of representing a physical scene, space, and/or object. Alternatively where “image” is used as a verb, in this disclosure, it refers to generation and/or formation of an image. Optical data/input image data may include image data as described above, without limitation.

Still referencing FIG. 1 , processor 104 is configured to verify the completion of assignment 108. In an embodiment, assignment 108 may be verified using an image processing module 124. An image processing module 124 may analyze input image data to ensure that they are authentic. For example, an image processing module may check to make sure that images are original and have not been modified, such as editing a “fail” into a “pass.” In an embodiment, an image processing module 124 may check for repetition of pixels from cloning. In another embodiment, image processing module 124 may check image input data for metadata, such as EXIF data for modifications to the EXIF data. In another embodiment, image processing module 124 may perform geometric analysis. Geometric analysis may include, without limitation, analysis to determine that lines in an image intersect properly, analysis to determine if shadows are consistent with a light source, and the like. In some cases an image processing module 124 may be used for registration of objects within a space. In some cases, registration may include image processing, such as without limitation object recognition, feature detection, edge/corner detection, and the like. Non-limiting examples of feature detection may include scale invariant feature transform (SIFT), Canny edge detection, Shi Tomasi corner detection, and the like. In some cases, registration may include one or more transformations to orient a camera frame (or an image or video stream) relative a three-dimensional coordinate system; exemplary transformations include without limitation homography transforms and affine transforms. In an embodiment, registration of first frame to a coordinate system may be verified and/or corrected using object identification and/or computer vision. Additionally, an image processing module 124 may analyze images to ensure that they accurately represent assignment 108. For example, an image processing module 124 may check that an image of a certificate says “TOASTMASTERS” for a TOASTMASTERS assignment. In some embodiments, image processing module 124 may include optical character recognition or optical character reader (OCR). OCR may include automatic conversion of images of written (e.g., typed, handwritten or printed text) into machine-encoded text. In some cases, recognition of at least a keyword from an image component may include one or more processes, including without limitation optical character recognition (OCR), optical word recognition, intelligent character recognition, intelligent word recognition, and the like. In some cases, OCR may recognize written text, one glyph or character at a time. In some cases, optical word recognition may recognize written text, one word at a time, for example, for languages that use a space as a word divider. In some cases, intelligent character recognition (ICR) may recognize written text one glyph or character at a time, for instance by employing machine learning processes. In some cases, intelligent word recognition (IWR) may recognize written text, one word at a time, for instance by employing machine learning processes.

Still referring to FIG. 1 , in some cases OCR may be an “offline” process, which analyses a static document or image frame. In some cases, handwriting movement analysis can be used as input to handwriting recognition. For example, instead of merely using shapes of glyphs and words, this technique may capture motions, such as the order in which segments are drawn, the direction, and the pattern of putting the pen down and lifting it. This additional information can make handwriting recognition more accurate. In some cases, this technology may be referred to as “online” character recognition, dynamic character recognition, real-time character recognition, and intelligent character recognition.

Still referring to FIG. 1 , in some cases, OCR processes may employ pre-processing of image component. Pre-processing process may include without limitation de-skew, de-speckle, binarization, line removal, layout analysis or “zoning,” line and word detection, script recognition, character isolation or “segmentation,” and normalization. In some cases, a de-skew process may include applying a transform (e.g., homography or affine transform) to image component to align text. In some cases, a de-speckle process may include removing positive and negative spots and/or smoothing edges. In some cases, a binarization process may include converting an image from color or greyscale to black-and-white (i.e., a binary image). Binarization may be performed as a simple way of separating text (or any other desired image component) from a background of image component. In some cases, binarization may be required for example if an employed OCR algorithm only works on binary images. In some cases, a line removal process may include removal of non-glyph or non-character imagery (e.g., boxes and lines). In some cases, a layout analysis or “zoning” process may identify columns, paragraphs, captions, and the like as distinct blocks. In some cases, a line and word detection process may establish a baseline for word and character shapes and separate words, if necessary. In some cases, a script recognition process may, for example in multilingual documents, identify script allowing an appropriate OCR algorithm to be selected. In some cases, a character isolation or “segmentation” process may separate signal characters, for example character-based OCR algorithms. In some cases, a normalization process may normalize aspect ratio and/or scale of image component.

Still referring to FIG. 1 , in some embodiments an OCR process will include an OCR algorithm. Exemplary OCR algorithms include matrix matching process and/or feature extraction processes. Matrix matching may involve comparing an image to a stored glyph on a pixel-by-pixel basis. In some case, matrix matching may also be known as “pattern matching,” “pattern recognition,” and/or “image correlation.” Matrix matching may rely on an input glyph being correctly isolated from the rest of the image component. Matrix matching may also rely on a stored glyph being in a similar font and at the same scale as input glyph. Matrix matching may work best with typewritten text.

Still referring to FIG. 1 , in some embodiments, an OCR process may include a feature extraction process. In some cases, feature extraction may decompose a glyph into features. Exemplary non-limiting features may include corners, edges, lines, closed loops, line direction, line intersections, and the like. In some cases, feature extraction may reduce dimensionality of representation and may make the recognition process computationally more efficient. In some cases, extracted feature can be compared with an abstract vector-like representation of a character, which might reduce to one or more glyph prototypes. General techniques of feature detection in computer vision are applicable to this type of OCR. In some embodiments, a machine-learning process like nearest neighbor classifiers (e.g., k-nearest neighbors algorithm) can be used to compare image features with stored glyph features and choose a nearest match. OCR may employ any machine-learning process described in this disclosure, for example machine-learning processes described with reference to FIG. 5 . Exemplary non-limiting OCR software includes Cuneiform and Tesseract. Cuneiform is a multi-language, open-source optical character recognition system originally developed by Cognitive Technologies of Moscow, Russia. Tesseract is free OCR software originally developed by Hewlett-Packard of Palo Alto, California, United States.

Still referring to FIG. 1 , in some cases, OCR may employ a two-pass approach to character recognition. Second pass may include adaptive recognition and use letter shapes recognized with high confidence on a first pass to recognize better remaining letters on the second pass. In some cases, two-pass approach may be advantageous for unusual fonts or low-quality image components where visual verbal content may be distorted. Another exemplary OCR software tool include OCRopus. OCRopus development is led by German Research Centre for Artificial Intelligence in Kaiserslautern, Germany. In some cases, OCR software may employ neural networks, for example neural networks as taught in reference to FIGS. 3-4 .

Still referring to FIG. 1 , in some cases, OCR may include post-processing. For example, OCR accuracy can be increased, in some cases, if output is constrained by a lexicon. A lexicon may include a list or set of words that are allowed to occur in a document. In some cases, a lexicon may include, for instance, all the words in the English language, or a more technical lexicon for a specific field. In some cases, an output stream may be a plain text stream or file of characters. In some cases, an OCR process may preserve an original layout of visual verbal content. In some cases, near-neighbor analysis can make use of co-occurrence frequencies to correct errors, by noting that certain words are often seen together. For example, “Washington, D.C.” is generally far more common in English than “Washington DOC.” In some cases, an OCR process may make us of a priori knowledge of grammar for a language being recognized. For example, grammar rules may be used to help determine if a word is likely to be a verb or a noun. Distance conceptualization may be employed for recognition and classification. For example, a Levenshtein distance algorithm may be used in OCR post-processing to further optimize results.

Continuing to reference FIG. 1 , in some embodiments, processor 104 may extract and/or recognize a feature 128. As used herein, a “feature” is an aspect of evidence 120 that supports the completion of assignment 108. Feature 128 may be recognized and extracted from an image or audio of evidence 120. For example, feature 128 may include filler words in a video recording of a user's speech. Processor 104 may extract the filler words from evidence 120 and tally them to determine the improvements in a user's public speaking. In this example, improving public speaking may be assignment 108. In another embodiment, expressions of a user's emotions may be represented by a number of features which may be extracted from evidence 120. Processor 104 may use a user's expressions to determine nervousness of a user and comfortability of a user to speak in front of an audience. In some cases, processor 104 may use machine vision to extract features from evidence 120.

Still referring to FIG. 1 , in some embodiments, apparatus 100 may include a machine vision process. A machine vision process may use images and images from videos submitted as evidence 120 to make a determination about the completion of assignment 108. For example, in some cases a machine vision process may be used for world modeling or registration of objects within a space. In some cases, registration and/or feature 128 recognition may include image processing, such as without limitation object recognition, feature detection, edge/corner detection, and the like. Non-limiting examples of feature 128 detection may include scale invariant feature transform (SIFT), Canny edge detection, Shi Tomasi corner detection, and the like. In some cases, a machine vision process may operate image classification and segmentation models, such as without limitation by way of machine vision resource (e.g., OpenMV or TensorFlow Lite). A machine vision process may detect motion, for example by way of frame differencing algorithms. A machine vision process may detect markers, for example blob detection, object detection, face detection, and the like. In some cases, a machine vision process may perform eye tracking (i.e., gaze estimation). In some cases, a machine vision process may perform person detection, for example by way of a trained machine learning model. In some cases, a machine vision process may perform motion detection (e.g., camera motion and/or object motion), for example by way of optical flow detection. In some cases, machine vision process may perform code (e.g., barcode) detection and decoding. In some cases, a machine vision process may additionally perform image capture and/or video recording.

Still referring to FIG. 1 , in some cases, machine vision process may perform pose-estimation, for example to ascertain a relative location or movement of objects within evidence 120. include one or more transformations, for example to a view of a frame relative a three-dimensional coordinate system; exemplary transformations include without limitation homography transforms and affine transforms. In an embodiment, registration of first frame to a coordinate system may be verified and/or corrected using object identification and/or computer vision, as described above. For instance, and without limitation, an initial registration to two dimensions, represented for instance as registration to the x and y coordinates, may be performed using a two-dimensional projection of points in three dimensions onto a first frame, however. A third dimension of registration, representing depth and/or a z axis, may be detected by comparison of two frames; image recognition and/or edge detection software may be used to detect multiple views of images of an object (from subsequent frames) to derive a relative position along a third (z) axis. In some cases, solicitation video 108 may include a stereo image, having two stereoscopic views, which may be compared to derive z-axis values of points on object permitting, for instance, derivation of further z-axis points within and/or around the object using interpolation. Alternatively or additionally, relative movement within an image component (e.g., frame to frame) may be used to ascertain positions of objects, even along a z-axis, for instance by way of kinetic parallax. In some cases, relative motion of objects further away may occur at a different speed than objects nearby. This phenomenon may be used to ascertain a position of objects relative to a camera, for example when the camera is moving. Object recognition and pose estimation may be repeated with multiple objects in field of view. In an embodiment, x and y axes may be chosen to span a plane common to a field of view of a camera used for image capturing and/or an xy plane of a first frame; a result, x and y translational components and ϕ may be pre-populated in translational and rotational matrices, for affine transformation of coordinates of object, also as described above. Initial x and y coordinates and/or guesses at transformational matrices may alternatively or additionally be performed between first frame and second frame, as described above. For each point of a plurality of points on object and/or edge and/or edges of object as described above, x and y coordinates of a first frame may be populated, with an initial estimate of z coordinates based, for instance, on assumptions about object, such as an assumption that ground is substantially parallel to an xy plane as selected above. Z coordinates, and/or x, y, and z coordinates, registered using image capturing and/or object identification processes as described above may then be compared to coordinates predicted using initial guess at transformation matrices; an error function may be computed using by comparing the two sets of points, and new x, y, and/or z coordinates, may be iteratively estimated and compared until the error function drops below a threshold level.

Still referring to FIG. 1 , in some cases, a machine vision process may use a classifier, such as any classifier described throughout this disclosure, for example with reference to FIG. 5 . Feature 128 recognition may include any feature recognition processes described in this disclosure. In some cases, a classifier may classify evidence 120 into categories, such as successful completion and/or incomplete. In some cases, evidence 120 and feature 128 may be represented and/or processed as a signal. As used in this disclosure, a “signal” is any intelligible representation of data, for example used to convey data from one device to another. A signal may include an optical signal, a hydraulic signal, a pneumatic signal, a mechanical signal, an electric signal, a digital signal, an analog signal, and the like. In some cases, a signal may be used to communicate with a computing device 104, for example by way of one or more ports. In some cases, a signal may be transmitted and/or received by a computing device for example by way of an input/output port. An analog signal may be digitized, for example by way of an analog to digital converter. In some cases, an analog signal may be processed, for example by way of any analog signal processing steps described in this disclosure, prior to digitization. In some cases, a digital signal may be used to communicate between two or more devices, including without limitation computing devices. In some cases, a digital signal may be communicated by way of one or more communication protocols, including without limitation internet protocol (IP), controller area network (CAN) protocols, serial communication protocols (e.g., universal asynchronous receiver-transmitter [UART]), parallel communication protocols (e.g., IEEE 128 [printer port]), and the like.

Still referring to FIG. 1 , in some cases, apparatus 100 may perform one or more signal processing steps on a signal. For instance, apparatus 100 may analyze, modify, and/or synthesize a signal representative of data in order to improve the signal, for instance by improving transmission, storage efficiency, or signal to noise ratio. Exemplary methods of signal processing may include analog, continuous time, discrete, digital, nonlinear, and statistical. Analog signal processing may be performed on non-digitized or analog signals. Exemplary analog processes may include passive filters, active filters, additive mixers, integrators, delay lines, compandors, multipliers, voltage-controlled filters, voltage-controlled oscillators, and phase-locked loops. Continuous-time signal processing may be used, in some cases, to process signals which vary continuously within a domain, for instance time. Exemplary non-limiting continuous time processes may include time domain processing, frequency domain processing (Fourier transform), and complex frequency domain processing. Discrete time signal processing may be used when a signal is sampled non-continuously or at discrete time intervals (i.e., quantized in time). Analog discrete-time signal processing may process a signal using the following exemplary circuits sample and hold circuits, analog time-division multiplexers, analog delay lines and analog feedback shift registers. Digital signal processing may be used to process digitized discrete-time sampled signals. Commonly, digital signal processing may be performed by a computing device or other specialized digital circuits, such as without limitation an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a specialized digital signal processor (DSP). Digital signal processing may be used to perform any combination of typical arithmetical operations, including fixed-point and floating-point, real-valued and complex-valued, multiplication and addition. Digital signal processing may additionally operate circular buffers and lookup tables. Further non-limiting examples of algorithms that may be performed according to digital signal processing techniques include fast Fourier transform (FFT), wavelet transform, finite impulse response (FIR) filter, infinite impulse response (IIR) filter, and adaptive filters such as the Wiener and Kalman filters. Statistical signal processing may be used to process a signal as a random function (i.e., a stochastic process), utilizing statistical properties. For instance, in some embodiments, a signal may be modeled with a probability distribution indicating noise, which then may be used to reduce noise in a processed signal.

With continued reference to FIG. 1 , processor 104 may also employ automatic speech recognition to examine evidence 120. Exemplary automatic speech recognition technologies include, without limitation, dynamic time warping (DTW)-based speech recognition, end-to-end automatic speech recognition, hidden Markov models, neural networks, including deep feedforward and recurrent neural networks, and the like. In an embodiment, automatic speech recognition may be used to determine whether an assignment 108 was complete. For example, speech recognition may be used to authenticate or verify an identity of a speaker. Speaker may be user 112, inner circle member 116, or the like. For example, a speaker may be congratulating user 112 of a completion of an assignment in a video submitted as evidence 120. In another example, a speaker may be user 112 demonstrating their Chinese ability in a video submitted as evidence 120.

Still referencing FIG. 1 , an inner circle member 116 may validate the completion of an assignment 108 by inputting an assignment status. An “assignment status” is the current situation of the assignment. For example, an assignment status may include “complete,” “incomplete,” “satisfactory,” “unsatisfactory,” and the like. An inner circle member 116 may be present during the completion of an assignment 108 by a user 112 and may indicate that the assignment 108 is complete. For example, an inner circle member 116, such as a parent, may witness that the user 112, their kid, finished raking the leaves. In another example, a teacher may validate that a child has received all as on their report card, completed an assignment, and/or completed a course. Alternatively, or additionally, an inner circle member 116 may view evidence 120 and determine the validity of the evidence 120. In the instance that assignment 108 is a clean run through of a musical piece, an inner circle member 116 may listen to the submitted evidence 120 and verify that it is satisfactory.

Continuing to reference FIG. 1 , processor 104 is configured to generate a token certificate 132 associated with the completion of assignment 108. As used in this disclosure, a “token certificate” is a unique and non-interchangeable unit of data stored on a ledger representing ownership of an asset and/or a financial interest. As used in this disclosure, a “ledger” is a digital immutable ledger where data entries may be posted and cannot be altered. Accordingly, token certificate 132 may prove ownership of an asset. An asset may include an achievement, physical artwork, digital artwork, music, in-game items, videos, photographs, real estate, and the like. In an embodiment, token certificate 132 may be a virtual embodiment of an achieved objective and/or completed assignment. A token certificate 132 may be stored on an immutable sequential listing 136. An “immutable sequential listing,” as used in this disclosure, is a data structure that places data entries in a fixed sequential arrangement, such as a temporal sequence of entries and/or blocks thereof, where the sequential arrangement, once established, cannot be altered or reordered. An immutable sequential listing may be, include and/or implement a ledger, where data entries that have been posted to the immutable sequential listing cannot be altered. An immutable sequential listing may include a directed acyclic graph. Ledger may be distributed across some or all nodes on a network, such as a peer-to-peer network, whereby each node replicates and saves an identical copy of the ledger and updates itself independently. A common example of an immutable sequential listing is a blockchain. Apparatus 100 may include embodiments of an immutable sequential listing discussed below in reference to FIG. 2 . Immutable sequential listing 136 may include multiple immutable sequential listings. Immutable sequential listing 136 may include shared and synchronized digital data which may be spread across multiple sites. Immutable sequential listing 136 may be stored and/or implemented on two or more nodes that may be connected by a network, such as on a peer-to-peer network. A node may include a device such as processor 104, any remote device, or the like. Nodes may be connected by a network and share information through a ledger that is distributed. There may be no central administrator or centralized data storage of information and/or data located on immutable sequential listing 136. As information is entered onto and updated on ledger shared by nodes on a network, each node may construct a new transaction. Nodes may then vote by a consensus algorithm as to which copy is correct. Consensus algorithms may include proof of work, proof of stake, or voting systems. Once a consensus has been determined, all other nodes may update themselves to reflect the new copy of the ledger. In some embodiments, nodes may copy ledger in its entirety. In other embodiments, nodes may copy one or more portions of ledger. Nodes may be connected through a peer-to-peer networking whereby nodes are equally privileged and equipotent participants. A peer-to-peer network may include a network of nodes that may make a portion of their resources available to other network participants. This may include resources such as processing power, disk storage or network bandwidth. Nodes located on a peer-to-peer network may both supply and consume resources. Apparatus 100 may utilize cryptographic keys and digital signatures to ensure node security and/or authenticity. Apparatus 100 may utilize digitally signed assertions as described in more detail below in reference to FIG. 2 .

Continuing to reference FIG. 1 , token certificate 132 may include information of the asset, such as a unique fingerprint of the asset file, a token name, a token symbol, and/or a link to a file posted on an interplanetary file system (“IPFS”). Processor 104 may be configured to generate token certificate 132. Token certificate 132 may be included in a ledger as part of immutable sequence listing. Token certificate 132 may include a plurality of token certificates. Token certificate 132 may be accessible at any of various security settings; for instance, and without limitation, token certificate 132 may be readable and modifiable publicly, may be publicly readable but writable only by entities and/or devices having access privileges established by password protection, confidence level, or any device authentication procedure or facilities described herein, or may be readable and/or writable only by entities and/or devices having such access privileges. Token certificate 132 may exist in more than one level, including, without limitation, a first access level or community of permitted entities and/or devices having ability to read, and a second access level or community of permitted entities and/or devices having ability to write; first and second community may be overlapping or non-overlapping. Processor 104 may be configured to record in immutable sequence listing 136 various events such as a creation of token certificate 132, an initial acquisition of the token certificate 132, any sales and/or resales of shares of token certificates, tickets based on token certificates, or the like, including without limitation the identity of the seller and purchaser, the purchase price, and/or a timestamp of the transaction.

Continuing to reference FIG. 1 , token certificate 132 may be associated with a user identifier 140. As used herein, a “user identifier” is a public key or a piece of data that associates a user to the block of information. User 112 may own token certificate 132 upon the verification of evidence 120 associated with assignment 108. A user identifier 140, such as their name, email, phone number, username, and/or other personal identifying information may be associated with token certificate 132. A user identifier 140 may be posted on an immutable sequential listing 136. The user identifier 140 may be retrieved and used to generate the token certificate 132. For example, the user identifier 140 may be linked with the associated assignment 108, and when the assignment 108 is complete, the token certificate 132 is generated and linked to the user identifier 140. In an embodiment, the token certificate 132 and the associated owner, which may be user 112, may be shared and visible to other people with access to the immutable sequential listing 136. In an embodiment, apparatus 100 may allow people, such as employers, or the like, to view accomplishments/assignments completed by a user and verified by an inner circle member 116 and/or processor 104. A token certificate 132 may be shared through a network, such as a wireless network. A token certificate 132 may be shared through a link, such as a URL link.

Referring now to FIG. 2 , an exemplary embodiment of an immutable sequential listing 136 is illustrated. Data elements may be listed in immutable sequential listing 136; data elements may include any form of data, including textual data, image data, encrypted data, cryptographically hashed data, and the like. Data elements may include, without limitation, one or more at least a digitally signed assertion. In one embodiment, a digitally signed assertion 204 is a collection of textual data signed using a secure proof as described in further detail below; secure proof may include, without limitation, a digital signature as described above. Collection of textual data may contain any textual data, including without limitation American Standard Code for Information Interchange (ASCII), Unicode, or similar computer-encoded textual data, any alphanumeric data, punctuation, diacritical mark, or any character or other marking used in any writing system to convey information, in any form, including any plaintext or cyphertext data; in an embodiment, collection of textual data may be encrypted, or may be a hash of other data, such as a root or node of a Merkle tree or hash tree, or a hash of any other information desired to be recorded in some fashion using a digitally signed assertion 204. In an embodiment, collection of textual data states that the owner of a certain transferable item represented in a digitally signed assertion 204 register is transferring that item to the owner of an address. A digitally signed assertion 204 may be signed by a digital signature created using the private key associated with the owner's public key, as described above.

Still referring to FIG. 2 , digitally signed assertion 204 may describe a transfer of virtual currency, such as crypto currency as described below. The virtual currency may be a digital currency. Item of value may be a transfer of trust, for instance represented by a statement vouching for the identity or trustworthiness of the first entity. Item of value may be an interest in a fungible negotiable financial instrument representing ownership in a public or private corporation, a creditor relationship with a governmental body or a corporation, rights to ownership represented by an option, derivative financial instrument, commodity, debt-backed security such as a bond or debenture or other security as described in further detail below. A resource may be a physical machine e.g., a ride share vehicle or any other asset. Digitally signed assertion 204 may describe the transfer of a physical good; for instance, a digitally signed assertion 204 may describe the sale of a product. In some embodiments, a transfer nominally of one item may be used to represent a transfer of another item; for instance, a transfer of virtual currency may be interpreted as representing a transfer of an access right; conversely, where the item nominally transferred is something other than virtual currency, the transfer itself may still be treated as a transfer of virtual currency, having value that depends on many potential factors including the value of the item nominally transferred and the monetary value attendant to having the output of the transfer moved into a particular user's control. The item of value may be associated with a digitally signed assertion 204 by means of an exterior protocol, such as the COLORED COINS created according to protocols developed by The Colored Coins Foundation, the MASTERCOIN protocol developed by the Mastercoin Foundation, or the ETHEREUM platform offered by the Stiftung Ethereum Foundation of Baar, Switzerland, the Thunder protocol developed by Thunder Consensus, or any other protocol.

Still referring to FIG. 2 , in one embodiment, an address is a textual datum identifying the recipient of virtual currency or another item of value in a digitally signed assertion 204. In some embodiments, address is linked to a public key, the corresponding private key of which is owned by the recipient of a digitally signed assertion 204. For instance, address may be the public key. An address may include a representation, such as a hash, of the public key. Address may be linked to the public key in memory of a computing device, for instance via a “wallet shortener” protocol. Where address is linked to a public key, a transferee in a digitally signed assertion 204 may record a subsequent a digitally signed assertion 204 transferring some or all of the value transferred in the first a digitally signed assertion 204 to a new address in the same manner. Digitally signed assertion 204 may contain textual information that is not a transfer of some item of value in addition to, or as an alternative to, such a transfer. For instance, as described in further detail below, a digitally signed assertion 204 may indicate a confidence level associated with a distributed storage node as described in further detail below.

In an embodiment, and still referring to FIG. 2 , immutable sequential listing 136 records a series of at least a posted content in a way that preserves the order in which the at least a posted content took place. Temporally sequential listing may be accessible at any of various security settings; for instance, and without limitation, temporally sequential listing may be readable and modifiable publicly, may be publicly readable but writable only by entities and/or devices having access privileges established by password protection, confidence level, or any device authentication procedure or facilities described herein, or may be readable and/or writable only by entities and/or devices having such access privileges. Access privileges may exist in more than one level, including, without limitation, a first access level or community of permitted entities and/or devices having ability to read, and a second access level or community of permitted entities and/or devices having ability to write; first and second community may be overlapping or non-overlapping. In an embodiment, posted content and/or immutable sequential listing 136 may be stored as one or more zero knowledge sets (ZKS), Private Information Retrieval (PIR) structure, or any other structure that allows checking of membership in a set by querying with specific properties. Such a database may incorporate protective measures to ensure that malicious actors may not query the database repeatedly in an effort to narrow the members of a set to reveal uniquely identifying information of a given posted content.

Still referring to FIG. 2 , immutable sequential listing 136 may preserve the order in which the at least a posted content took place by listing them in chronological order; alternatively or additionally, immutable sequential listing 136 may organize digitally signed assertions 204 into sub-listings 208 such as “blocks” in a blockchain, which may be themselves collected in a temporally sequential order; digitally signed assertions 204 within a sub-listing 208 may or may not be temporally sequential. The ledger may preserve the order in which at least a posted content took place by listing them in sub-listings 208 and placing the sub-listings 208 in chronological order. The immutable sequential listing 136 may be a distributed, consensus-based ledger, such as those operated according to the protocols promulgated by Ripple Labs, Inc., of San Francisco, Calif., or the Stellar Development Foundation, of San Francisco, Calif, or of Thunder Consensus. In some embodiments, the ledger is a secured ledger; in one embodiment, a secured ledger is a ledger having safeguards against alteration by unauthorized parties. The ledger may be maintained by a proprietor, such as a system administrator on a server, that controls access to the ledger; for instance, the user account controls may allow contributors to the ledger to add at least a posted content to the ledger, but may not allow any users to alter at least a posted content that have been added to the ledger. In some embodiments, ledger is cryptographically secured; in one embodiment, a ledger is cryptographically secured where each link in the chain contains encrypted or hashed information that makes it practically infeasible to alter the ledger without betraying that alteration has taken place, for instance by requiring that an administrator or other party sign new additions to the chain with a digital signature. Immutable sequential listing 136 may be incorporated in, stored in, or incorporate, any suitable data structure, including without limitation any database, datastore, file structure, distributed hash table, directed acyclic graph or the like. In some embodiments, the timestamp of an entry is cryptographically secured and validated via trusted time, either directly on the chain or indirectly by utilizing a separate chain. In one embodiment the validity of timestamp is provided using a time stamping authority as described in the RFC 3161 standard for trusted timestamps, or in the ANSI ASC x9.95 standard. In another embodiment, the trusted time ordering is provided by a group of entities collectively acting as the time stamping authority with a requirement that a threshold number of the group of authorities sign the timestamp.

In some embodiments, and with continued reference to FIG. 2 , immutable sequential listing 136, once formed, may be inalterable by any party, no matter what access rights that party possesses. For instance, immutable sequential listing 136 may include a hash chain, in which data is added during a successive hashing process to ensure non-repudiation. Immutable sequential listing 136 may include a block chain. In one embodiment, a block chain is immutable sequential listing 136 that records one or more new at least a posted content in a data item known as a sub-listing 208 or “block.” An example of a block chain is the BITCOIN block chain used to record BITCOIN transactions and values. Sub-listings 208 may be created in a way that places the sub-listings 208 in chronological order and link each sub-listing 208 to a previous sub-listing 208 in the chronological order so that any computing device may traverse the sub-listings 208 in reverse chronological order to verify any at least a posted content listed in the block chain. Each new sub-listing 208 may be required to contain a cryptographic hash describing the previous sub-listing 208. In some embodiments, the block chain contains a single first sub-listing 208 sometimes known as a “genesis block.”

Still referring to FIG. 2 , the creation of a new sub-listing 208 may be computationally expensive; for instance, the creation of a new sub-listing 208 may be designed by a “proof of work” protocol accepted by all participants in forming the immutable sequential listing 136 to take a powerful set of computing devices a certain period of time to produce. Where one sub-listing 208 takes less time for a given set of computing devices to produce the sub-listing 208 protocol may adjust the algorithm to produce the next sub-listing 208 so that it will require more steps; where one sub-listing 208 takes more time for a given set of computing devices to produce the sub-listing 208 protocol may adjust the algorithm to produce the next sub-listing 208 so that it will require fewer steps. As an example, protocol may require a new sub-listing 208 to contain a cryptographic hash describing its contents; the cryptographic hash may be required to satisfy a mathematical condition, achieved by having the sub-listing 208 contain a number, called a nonce, whose value is determined after the fact by the discovery of the hash that satisfies the mathematical condition. Continuing the example, the protocol may be able to adjust the mathematical condition so that the discovery of the hash describing a sub-listing 208 and satisfying the mathematical condition requires more or less steps, depending on the outcome of the previous hashing attempt. Mathematical condition, as an example, might be that the hash contains a certain number of leading zeros and a hashing algorithm that requires more steps to find a hash containing a greater number of leading zeros, and fewer steps to find a hash containing a lesser number of leading zeros. In some embodiments, production of a new sub-listing 208 according to the protocol is known as “mining.” The creation of a new sub-listing 208 may be designed by a “proof of stake” protocol as will be apparent to those skilled in the art upon reviewing the entirety of this disclosure.

Continuing to refer to FIG. 2 , in some embodiments, protocol also creates an incentive to mine new sub-listings 208. The incentive may be financial; for instance, successfully mining a new sub-listing 208 may result in the person or entity that mines the sub-listing 208 receiving a predetermined amount of currency. The currency may be fiat currency. Currency may be cryptocurrency as defined below. In other embodiments, incentive may be redeemed for particular products or services; the incentive may be a gift certificate with a particular business, for instance. In some embodiments, incentive is sufficiently attractive to cause participants to compete for the incentive by trying to race each other to the creation of sub-listings 208 Each sub-listing 208 created in immutable sequential listing 136 may contain a record or at least a posted content describing one or more addresses that receive an incentive, such as virtual currency, as the result of successfully mining the sub-listing 208.

With continued reference to FIG. 2 , where two entities simultaneously create new sub-listings 208, immutable sequential listing 136 may develop a fork; protocol may determine which of the two alternate branches in the fork is the valid new portion of the immutable sequential listing 136 by evaluating, after a certain amount of time has passed, which branch is longer. “Length” may be measured according to the number of sub-listings 208 in the branch. Length may be measured according to the total computational cost of producing the branch. Protocol may treat only at least a posted content contained the valid branch as valid at least a posted content. When a branch is found invalid according to this protocol, at least a posted content registered in that branch may be recreated in a new sub-listing 208 in the valid branch; the protocol may reject “double spending” at least a posted content that transfer the same virtual currency that another at least a posted content in the valid branch has already transferred. As a result, in some embodiments the creation of fraudulent at least a posted content requires the creation of a longer immutable sequential listing 136 branch by the entity attempting the fraudulent at least a posted content than the branch being produced by the rest of the participants; as long as the entity creating the fraudulent at least a posted content is likely the only one with the incentive to create the branch containing the fraudulent at least a posted content, the computational cost of the creation of that branch may be practically infeasible, guaranteeing the validity of all at least a posted content in the immutable sequential listing 136.

Still referring to FIG. 2 , additional data linked to at least a posted content may be incorporated in sub-listings 208 in the immutable sequential listing 136; for instance, data may be incorporated in one or more fields recognized by block chain protocols that permit a person or computer forming a at least a posted content to insert additional data in the immutable sequential listing 136. In some embodiments, additional data is incorporated in an unspendable at least a posted content field. For instance, the data may be incorporated in an OP RETURN within the BITCOIN block chain. In other embodiments, additional data is incorporated in one signature of a multi-signature at least a posted content. In an embodiment, a multi-signature at least a posted content is at least a posted content to two or more addresses. In some embodiments, the two or more addresses are hashed together to form a single address, which is signed in the digital signature of the at least a posted content. In other embodiments, the two or more addresses are concatenated. In some embodiments, two or more addresses may be combined by a more complicated process, such as the creation of a Merkle tree or the like. In some embodiments, one or more addresses incorporated in the multi-signature at least a posted content are typical crypto-currency addresses, such as addresses linked to public keys as described above, while one or more additional addresses in the multi-signature at least a posted content contain additional data related to the at least a posted content; for instance, the additional data may indicate the purpose of the at least a posted content, aside from an exchange of virtual currency, such as the item for which the virtual currency was exchanged. In some embodiments, additional information may include network statistics for a given node of network, such as a distributed storage node, e.g. the latencies to nearest neighbors in a network graph, the identities or identifying information of neighboring nodes in the network graph, the trust level and/or mechanisms of trust (e.g. certificates of physical encryption keys, certificates of software encryption keys, (in non-limiting example certificates of software encryption may indicate the firmware version, manufacturer, hardware version and the like), certificates from a trusted third party, certificates from a decentralized anonymous authentication procedure, and other information quantifying the trusted status of the distributed storage node) of neighboring nodes in the network graph, IP addresses, GPS coordinates, and other information informing location of the node and/or neighboring nodes, geographically and/or within the network graph. In some embodiments, additional information may include history and/or statistics of neighboring nodes with which the node has interacted. In some embodiments, this additional information may be encoded directly, via a hash, hash tree or other encoding.

With continued reference to FIG. 2 , in some embodiments, virtual currency is traded as a crypto-currency. In one embodiment, a crypto-currency is a digital, currency such as Bitcoins, Peercoins, Namecoins, and Litecoins. Crypto-currency may be a clone of another crypto-currency. The crypto-currency may be an “alt-coin.” Crypto-currency may be decentralized, with no particular entity controlling it; the integrity of the crypto-currency may be maintained by adherence by its participants to established protocols for exchange and for production of new currency, which may be enforced by software implementing the crypto-currency. Crypto-currency may be centralized, with its protocols enforced or hosted by a particular entity. For instance, crypto-currency may be maintained in a centralized ledger, as in the case of the XRP currency of Ripple Labs, Inc., of San Francisco, Calif In lieu of a centrally controlling authority, such as a national bank, to manage currency values, the number of units of a particular crypto-currency may be limited; the rate at which units of crypto-currency enter the market may be managed by a mutually agreed-upon process, such as creating new units of currency when mathematical puzzles are solved, the degree of difficulty of the puzzles being adjustable to control the rate at which new units enter the market. Mathematical puzzles may be the same as the algorithms used to make productions of sub-listings 208 in a block chain computationally challenging; the incentive for producing sub-listings 208 may include the grant of new crypto-currency to the miners. Quantities of crypto-currency may be exchanged using at least a posted content as described above.

Referring now to FIG. 3 , an exemplary embodiment of neural network 300 is illustrated. A neural network 300, also known as an artificial neural network, is a network of “nodes,” or data structures having one or more inputs, one or more outputs, and a function determining outputs based on inputs. Such nodes may be organized in a network, such as without limitation a convolutional neural network, including an input layer of nodes 304, one or more intermediate layers 308, and an output layer of nodes 312. Connections between nodes may be created via the process of “training” the network, in which elements from a training dataset are applied to the input nodes, a suitable training algorithm (such as Levenberg-Marquardt, conjugate gradient, simulated annealing, or other algorithms) is then used to adjust the connections and weights between nodes in adjacent layers of the neural network to produce the desired values at the output nodes. This process is sometimes referred to as deep learning. Connections may run solely from input nodes toward output nodes in a “feed-forward” network or may feed outputs of one layer back to inputs of the same or a different layer in a “recurrent network.” As a further non-limiting example, a neural network may include a convolutional neural network comprising an input layer of nodes, one or more intermediate layers, and an output layer of nodes. A “convolutional neural network,” as used in this disclosure, is a neural network in which at least one hidden layer is a convolutional layer that convolves inputs to that layer with a subset of inputs known as a “kernel,” along with one or more additional layers such as pooling layers, fully connected layers, and the like.

Referring now to FIG. 4 , an exemplary embodiment of a node of a neural network is illustrated. A node may include, without limitation, a plurality of inputs xi that may receive numerical values from inputs to a neural network containing the node and/or from other nodes. Node may perform a weighted sum of inputs using weights w_(i) that are multiplied by respective inputs x_(i). Additionally or alternatively, a bias b may be added to the weighted sum of the inputs such that an offset is added to each unit in the neural network layer that is independent of the input to the layer. The weighted sum may then be input into a function co, which may generate one or more outputs y. Weight w_(i) applied to an input x_(i) may indicate whether the input is “excitatory,” indicating that it has strong influence on the one or more outputs y, for instance by the corresponding weight having a large numerical value, and/or a “inhibitory,” indicating it has a weak effect influence on the one more inputs y, for instance by the corresponding weight having a small numerical value. The values of weights w_(i) may be determined by training a neural network using training data, which may be performed using any suitable process as described above.

Referring now to FIG. 5 , an exemplary embodiment of a machine-learning module 500 that may perform one or more machine-learning processes as described in this disclosure is illustrated. Machine-learning module may perform determinations, classification, and/or analysis steps, methods, processes, or the like as described in this disclosure using machine learning processes. A “machine learning process,” as used in this disclosure, is a process that automatedly uses training data 504 to generate an algorithm that will be performed by a computing device/module to produce outputs 508 given data provided as inputs 512; this is in contrast to a non-machine learning software program where the commands to be executed are determined in advance by a user and written in a programming language.

Still referring to FIG. 5 , “training data,” as used herein, is data containing correlations that a machine-learning process may use to model relationships between two or more categories of data elements. For instance, and without limitation, training data 504 may include a plurality of data entries, each entry representing a set of data elements that were recorded, received, and/or generated together; data elements may be correlated by shared existence in a given data entry, by proximity in a given data entry, or the like. Multiple data entries in training data 504 may evince one or more trends in correlations between categories of data elements; for instance, and without limitation, a higher value of a first data element belonging to a first category of data element may tend to correlate to a higher value of a second data element belonging to a second category of data element, indicating a possible proportional or other mathematical relationship linking values belonging to the two categories. Multiple categories of data elements may be related in training data 504 according to various correlations; correlations may indicate causative and/or predictive links between categories of data elements, which may be modeled as relationships such as mathematical relationships by machine-learning processes as described in further detail below. Training data 504 may be formatted and/or organized by categories of data elements, for instance by associating data elements with one or more descriptors corresponding to categories of data elements. As a non-limiting example, training data 504 may include data entered in standardized forms by persons or processes, such that entry of a given data element in a given field in a form may be mapped to one or more descriptors of categories. Elements in training data 504 may be linked to descriptors of categories by tags, tokens, or other data elements; for instance, and without limitation, training data 504 may be provided in fixed-length formats, formats linking positions of data to categories such as comma-separated value (CSV) formats and/or self-describing formats such as extensible markup language (XML), JavaScript Object Notation (JSON), or the like, enabling processes or devices to detect categories of data.

Alternatively or additionally, and continuing to refer to FIG. 5 , training data 504 may include one or more elements that are not categorized; that is, training data 504 may not be formatted or contain descriptors for some elements of data. Machine-learning algorithms and/or other processes may sort training data 504 according to one or more categorizations using, for instance, natural language processing algorithms, tokenization, detection of correlated values in raw data and the like; categories may be generated using correlation and/or other processing algorithms. As a non-limiting example, in a corpus of text, phrases making up a number “n” of compound words, such as nouns modified by other nouns, may be identified according to a statistically significant prevalence of n-grams containing such words in a particular order; such an n-gram may be categorized as an element of language such as a “word” to be tracked similarly to single words, generating a new category as a result of statistical analysis. Similarly, in a data entry including some textual data, a person's name may be identified by reference to a list, dictionary, or other compendium of terms, permitting ad-hoc categorization by machine-learning algorithms, and/or automated association of data in the data entry with descriptors or into a given format. The ability to categorize data entries automatedly may enable the same training data 504 to be made applicable for two or more distinct machine-learning algorithms as described in further detail below. Training data 504 used by machine-learning module 500 may correlate any input data as described in this disclosure to any output data as described in this disclosure.

Further referring to FIG. 5 , training data may be filtered, sorted, and/or selected using one or more supervised and/or unsupervised machine-learning processes and/or models as described in further detail below; such models may include without limitation a training data classifier 516. Training data classifier 516 may include a “classifier,” which as used in this disclosure is a machine-learning model as defined below, such as a mathematical model, neural net, or program generated by a machine learning algorithm known as a “classification algorithm,” as described in further detail below, that sorts inputs into categories or bins of data, outputting the categories or bins of data and/or labels associated therewith. A classifier may be configured to output at least a datum that labels or otherwise identifies a set of data that are clustered together, found to be close under a distance metric as described below, or the like. Machine-learning module 500 may generate a classifier using a classification algorithm, defined as a processes whereby a computing device and/or any module and/or component operating thereon derives a classifier from training data 504. Classification may be performed using, without limitation, linear classifiers such as without limitation logistic regression and/or naive Bayes classifiers, nearest neighbor classifiers such as k-nearest neighbors classifiers, support vector machines, least squares support vector machines, fisher's linear discriminant, quadratic classifiers, decision trees, boosted trees, random forest classifiers, learning vector quantization, and/or neural network-based classifiers.

Still referring to FIG. 5 , machine-learning module 500 may be configured to perform a lazy-learning process 520 and/or protocol, which may alternatively be referred to as a “lazy loading” or “call-when-needed” process and/or protocol, may be a process whereby machine learning is conducted upon receipt of an input to be converted to an output, by combining the input and training set to derive the algorithm to be used to produce the output on demand. For instance, an initial set of simulations may be performed to cover an initial heuristic and/or “first guess” at an output and/or relationship. As a non-limiting example, an initial heuristic may include a ranking of associations between inputs and elements of training data 504. Heuristic may include selecting some number of highest-ranking associations and/or training data 504 elements. Lazy learning may implement any suitable lazy learning algorithm, including without limitation a K-nearest neighbors algorithm, a lazy naïve Bayes algorithm, or the like; persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various lazy-learning algorithms that may be applied to generate outputs as described in this disclosure, including without limitation lazy learning applications of machine-learning algorithms as described in further detail below.

Alternatively or additionally, and with continued reference to FIG. 5 , machine-learning processes as described in this disclosure may be used to generate machine-learning models 524. A “machine-learning model,” as used in this disclosure, is a mathematical and/or algorithmic representation of a relationship between inputs and outputs, as generated using any machine-learning process including without limitation any process as described above, and stored in memory; an input is submitted to a machine-learning model 524 once created, which generates an output based on the relationship that was derived. For instance, and without limitation, a linear regression model, generated using a linear regression algorithm, may compute a linear combination of input data using coefficients derived during machine-learning processes to calculate an output datum. As a further non-limiting example, a machine-learning model 524 may be generated by creating an artificial neural network, such as a convolutional neural network comprising an input layer of nodes, one or more intermediate layers, and an output layer of nodes. Connections between nodes may be created via the process of “training” the network, in which elements from a training data 504 set are applied to the input nodes, a suitable training algorithm (such as Levenberg-Marquardt, conjugate gradient, simulated annealing, or other algorithms) is then used to adjust the connections and weights between nodes in adjacent layers of the neural network to produce the desired values at the output nodes. This process is sometimes referred to as deep learning.

Still referring to FIG. 5 , machine-learning algorithms may include at least a supervised machine-learning process 528. At least a supervised machine-learning process 528, as defined herein, include algorithms that receive a training set relating a number of inputs to a number of outputs, and seek to find one or more mathematical relations relating inputs to outputs, where each of the one or more mathematical relations is optimal according to some criterion specified to the algorithm using some scoring function. For instance, a supervised learning algorithm may include inputs and outputs as described above in this disclosure, and a scoring function representing a desired form of relationship to be detected between inputs and outputs; scoring function may, for instance, seek to maximize the probability that a given input and/or combination of elements inputs is associated with a given output to minimize the probability that a given input is not associated with a given output. Scoring function may be expressed as a risk function representing an “expected loss” of an algorithm relating inputs to outputs, where loss is computed as an error function representing a degree to which a prediction generated by the relation is incorrect when compared to a given input-output pair provided in training data 504. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various possible variations of at least a supervised machine-learning process 528 that may be used to determine relation between inputs and outputs. Supervised machine-learning processes may include classification algorithms as defined above.

Further referring to FIG. 5 , machine learning processes may include at least an unsupervised machine-learning processes 532. An unsupervised machine-learning process, as used herein, is a process that derives inferences in datasets without regard to labels; as a result, an unsupervised machine-learning process may be free to discover any structure, relationship, and/or correlation provided in the data. Unsupervised processes may not require a response variable; unsupervised processes may be used to find interesting patterns and/or inferences between variables, to determine a degree of correlation between two or more variables, or the like.

Still referring to FIG. 5 , machine-learning module 500 may be designed and configured to create a machine-learning model 524 using techniques for development of linear regression models. Linear regression models may include ordinary least squares regression, which aims to minimize the square of the difference between predicted outcomes and actual outcomes according to an appropriate norm for measuring such a difference (e.g. a vector-space distance norm); coefficients of the resulting linear equation may be modified to improve minimization. Linear regression models may include ridge regression methods, where the function to be minimized includes the least-squares function plus term multiplying the square of each coefficient by a scalar amount to penalize large coefficients. Linear regression models may include least absolute shrinkage and selection operator (LASSO) models, in which ridge regression is combined with multiplying the least-squares term by a factor of 1 divided by double the number of samples. Linear regression models may include a multi-task lasso model wherein the norm applied in the least-squares term of the lasso model is the Frobenius norm amounting to the square root of the sum of squares of all terms. Linear regression models may include the elastic net model, a multi-task elastic net model, a least angle regression model, a LARS lasso model, an orthogonal matching pursuit model, a Bayesian regression model, a logistic regression model, a stochastic gradient descent model, a perceptron model, a passive aggressive algorithm, a robustness regression model, a Huber regression model, or any other suitable model that may occur to persons skilled in the art upon reviewing the entirety of this disclosure. Linear regression models may be generalized in an embodiment to polynomial regression models, whereby a polynomial equation (e.g. a quadratic, cubic or higher-order equation) providing a best predicted output/actual output fit is sought; similar methods to those described above may be applied to minimize error functions, as will be apparent to persons skilled in the art upon reviewing the entirety of this disclosure.

Continuing to refer to FIG. 5 , machine-learning algorithms may include, without limitation, linear discriminant analysis. Machine-learning algorithm may include quadratic discriminate analysis. Machine-learning algorithms may include kernel ridge regression. Machine-learning algorithms may include support vector machines, including without limitation support vector classification-based regression processes. Machine-learning algorithms may include stochastic gradient descent algorithms, including classification and regression algorithms based on stochastic gradient descent. Machine-learning algorithms may include nearest neighbors algorithms. Machine-learning algorithms may include various forms of latent space regularization such as variational regularization. Machine-learning algorithms may include Gaussian processes such as Gaussian Process Regression. Machine-learning algorithms may include cross-decomposition algorithms, including partial least squares and/or canonical correlation analysis. Machine-learning algorithms may include naive Bayes methods. Machine-learning algorithms may include algorithms based on decision trees, such as decision tree classification or regression algorithms. Machine-learning algorithms may include ensemble methods such as bagging meta-estimator, forest of randomized tress, AdaBoost, gradient tree boosting, and/or voting classifier methods. Machine-learning algorithms may include neural net algorithms, including convolutional neural net processes.

Now referencing FIG. 6 , a flow diagram of a method 600 for generating a token certificate associated with an assignment is shown. Step 605 of method 600 includes receiving an indication of completion of an assignment. An assignment may be associated with a user. An assignment may include objectives to be accomplished. Objectives may be set by an inner circle member such as a parent. Indication of completion of an assignment may include inputting image data. A user and/or an inner circle member may input image data. Persons may use a device such as a smartphone, tablet, laptop, or the like to transmit an image, or the like, to processor 104. Additionally, video, audio, or written data may also be submitted to indicate completion of an assignment. This may be implemented as disclosed with references to FIGS. 1-5 above.

Step 610 of method 600 includes verifying the completion of the assignment. Image data may be processed using an image processing module to verify the completion of the assignment. Additionally, other multimedia data (video, audio, text, or the like) may be processed using OCR, automatic speech recognition to verify that the assignment was completed. This may include processing an audio recording for the user's voice to ensure that the user completed the assignment. This may be implemented as disclosed with references to FIGS. 1-5 above.

Step 615 of method 600 includes generating a token certificate associated with the completion of the assignment. A token certificate may be generated on a decentralized platform, such as an immutable sequential listing. A token certificate may be associated with the identity of the user that completed the assignment. The token certificate and the respective assignment data (evidence of completion, and the like) may be shared on a decentralized platform. A user and/or inner circle member may share a link, such as a URL link to show the token certificate. This may be implemented as disclosed with references to FIGS. 1-5 above. Any of the other determinations described in this application, including determinations of authenticity, determinations made by image processing, or the like, may be included in the token certificate. Determinations may be included using a cryptographic accumulator. A “cryptographic accumulator,” as used in this disclosure, is a data structure created by relating a commitment, which may be smaller amount of data that may be referred to as an “accumulator” and/or “root,” to a set of elements, such as lots of data and/or collection of data, together with short membership and/or nonmembership proofs for any element in the set. In an embodiment, these proofs may be publicly verifiable against the commitment. An accumulator may be said to be “dynamic” if the commitment and membership proofs can be updated efficiently as elements are added or removed from the set, at unit cost independent of the number of accumulated elements; an accumulator for which this is not the case may be referred to as “static.” A membership proof may be referred to as a as a “witness” whereby an element existing in the larger amount of data can be shown to be included in the root, while an element not existing in the larger amount of data can be shown not to be included in the root, where “inclusion” indicates that the included element was a part of the process of generating the root 308, and therefore was included in the original larger data set.

It is to be noted that any one or more of the aspects and embodiments described herein may be conveniently implemented using one or more machines (e.g., one or more computing devices that are utilized as a user computing device for an electronic document, one or more server devices, such as a document server, etc.) programmed according to the teachings of the present specification, as will be apparent to those of ordinary skill in the computer art. Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those of ordinary skill in the software art. Aspects and implementations discussed above employing software and/or software modules may also include appropriate hardware for assisting in the implementation of the machine executable instructions of the software and/or software module.

Such software may be a computer program product that employs a machine-readable storage medium. A machine-readable storage medium may be any medium that is capable of storing and/or encoding a sequence of instructions for execution by a machine (e.g., a computing device) and that causes the machine to perform any one of the methodologies and/or embodiments described herein. Examples of a machine-readable storage medium include, but are not limited to, a magnetic disk, an optical disc (e.g., CD, CD-R, DVD, DVD-R, etc.), a magneto-optical disk, a read-only memory “ROM” device, a random access memory “RAM” device, a magnetic card, an optical card, a solid-state memory device, an EPROM, an EEPROM, and any combinations thereof. A machine-readable medium, as used herein, is intended to include a single medium as well as a collection of physically separate media, such as, for example, a collection of compact discs or one or more hard disk drives in combination with a computer memory. As used herein, a machine-readable storage medium does not include transitory forms of signal transmission.

Such software may also include information (e.g., data) carried as a data signal on a data carrier, such as a carrier wave. For example, machine-executable information may be included as a data-carrying signal embodied in a data carrier in which the signal encodes a sequence of instruction, or portion thereof, for execution by a machine (e.g., a computing device) and any related information (e.g., data structures and data) that causes the machine to perform any one of the methodologies and/or embodiments described herein.

Examples of a computing device include, but are not limited to, an electronic book reading device, a computer workstation, a terminal computer, a server computer, a handheld device (e.g., a tablet computer, a smartphone, etc.), a web appliance, a network router, a network switch, a network bridge, any machine capable of executing a sequence of instructions that specify an action to be taken by that machine, and any combinations thereof. In one example, a computing device may include and/or be included in a kiosk.

FIG. 7 shows a diagrammatic representation of one embodiment of a computing device in the exemplary form of a computer system 700 within which a set of instructions for causing a control system to perform any one or more of the aspects and/or methodologies of the present disclosure may be executed. It is also contemplated that multiple computing devices may be utilized to implement a specially configured set of instructions for causing one or more of the devices to perform any one or more of the aspects and/or methodologies of the present disclosure. Computer system 700 includes a processor 704 and a memory 708 that communicate with each other, and with other components, via a bus 712. Bus 712 may include any of several types of bus structures including, but not limited to, a memory bus, a memory controller, a peripheral bus, a local bus, and any combinations thereof, using any of a variety of bus architectures.

Processor 704 may include any suitable processor, such as without limitation a processor incorporating logical circuitry for performing arithmetic and logical operations, such as an arithmetic and logic unit (ALU), which may be regulated with a state machine and directed by operational inputs from memory and/or sensors; processor 704 may be organized according to Von Neumann and/or Harvard architecture as a non-limiting example. Processor 704 may include, incorporate, and/or be incorporated in, without limitation, a microcontroller, microprocessor, digital signal processor (DSP), Field Programmable Gate Array (FPGA), Complex Programmable Logic Device (CPLD), Graphical Processing Unit (GPU), general purpose GPU, Tensor Processing Unit (TPU), analog or mixed signal processor, Trusted Platform Module (TPM), a floating point unit (FPU), and/or system on a chip (SoC).

Memory 708 may include various components (e.g., machine-readable media) including, but not limited to, a random-access memory component, a read only component, and any combinations thereof. In one example, a basic input/output system 716 (BIOS), including basic routines that help to transfer information between elements within computer system 700, such as during start-up, may be stored in memory 708. Memory 708 may also include (e.g., stored on one or more machine-readable media) instructions (e.g., software) 720 embodying any one or more of the aspects and/or methodologies of the present disclosure. In another example, memory 708 may further include any number of program modules including, but not limited to, an operating system, one or more application programs, other program modules, program data, and any combinations thereof.

Computer system 700 may also include a storage device 724. Examples of a storage device (e.g., storage device 724) include, but are not limited to, a hard disk drive, a magnetic disk drive, an optical disc drive in combination with an optical medium, a solid-state memory device, and any combinations thereof. Storage device 724 may be connected to bus 712 by an appropriate interface (not shown). Example interfaces include, but are not limited to, SCSI, advanced technology attachment (ATA), serial ATA, universal serial bus (USB), IEEE 1394 (FIREWIRE), and any combinations thereof. In one example, storage device 724 (or one or more components thereof) may be removably interfaced with computer system 700 (e.g., via an external port connector (not shown)). Particularly, storage device 724 and an associated machine-readable medium 728 may provide nonvolatile and/or volatile storage of machine-readable instructions, data structures, program modules, and/or other data for computer system 700. In one example, software 720 may reside, completely or partially, within machine-readable medium 728. In another example, software 720 may reside, completely or partially, within processor 704.

Computer system 700 may also include an input device 732. In one example, a user of computer system 700 may enter commands and/or other information into computer system 700 via input device 732. Examples of an input device 732 include, but are not limited to, an alpha-numeric input device (e.g., a keyboard), a pointing device, a joystick, a gamepad, an audio input device (e.g., a microphone, a voice response system, etc.), a cursor control device (e.g., a mouse), a touchpad, an optical scanner, a video capture device (e.g., a still camera, a video camera), a touchscreen, and any combinations thereof. Input device 732 may be interfaced to bus 712 via any of a variety of interfaces (not shown) including, but not limited to, a serial interface, a parallel interface, a game port, a USB interface, a FIREWIRE interface, a direct interface to bus 712, and any combinations thereof. Input device 732 may include a touch screen interface that may be a part of or separate from display 736, discussed further below. Input device 732 may be utilized as a user selection device for selecting one or more graphical representations in a graphical interface as described above.

A user may also input commands and/or other information to computer system 700 via storage device 724 (e.g., a removable disk drive, a flash drive, etc.) and/or network interface device 740. A network interface device, such as network interface device 740, may be utilized for connecting computer system 700 to one or more of a variety of networks, such as network 744, and one or more remote devices 748 connected thereto. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network, such as network 744, may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software 720, etc.) may be communicated to and/or from computer system 700 via network interface device 740.

Computer system 700 may further include a video display adapter 752 for communicating a displayable image to a display device, such as display device 736. Examples of a display device include, but are not limited to, a liquid crystal display (LCD), a cathode ray tube (CRT), a plasma display, a light emitting diode (LED) display, and any combinations thereof. Display adapter 752 and display device 736 may be utilized in combination with processor 704 to provide graphical representations of aspects of the present disclosure. In addition to a display device, computer system 700 may include one or more other peripheral output devices including, but not limited to, an audio speaker, a printer, and any combinations thereof. Such peripheral output devices may be connected to bus 712 via a peripheral interface 756. Examples of a peripheral interface include, but are not limited to, a serial port, a USB connection, a FIREWIRE connection, a parallel connection, and any combinations thereof.

The foregoing has been a detailed description of illustrative embodiments of the invention. Various modifications and additions can be made without departing from the spirit and scope of this invention. Features of each of the various embodiments described above may be combined with features of other described embodiments as appropriate in order to provide a multiplicity of feature combinations in associated new embodiments. Furthermore, while the foregoing describes a number of separate embodiments, what has been described herein is merely illustrative of the application of the principles of the present invention. Additionally, although particular methods herein may be illustrated and/or described as being performed in a specific order, the ordering is highly variable within ordinary skill to achieve methods, systems, and software according to the present disclosure. Accordingly, this description is meant to be taken only by way of example, and not to otherwise limit the scope of this invention.

Exemplary embodiments have been disclosed above and illustrated in the accompanying drawings. It will be understood by those skilled in the art that various changes, omissions, and additions may be made to that which is specifically disclosed herein without departing from the spirit and scope of the present invention. 

What is claimed is:
 1. An apparatus for generating a token certificate associated with an assignment, the apparatus comprising: at least a processor; and a memory communicatively connected to the at least a processor, the memory containing instructions configuring the at least a processor to: receive an indication of a completion of an assignment related to a user; verify the completion of the assignment related to the user using an image processing module; and generate a token certificate as a function of the completion of the assignment, wherein generating the token certificate comprises: retrieving a user identifier; and generating the token certificate as a function of the user identifier.
 2. The apparatus of claim 1, wherein verifying the completion of the assignment related to the user comprises, using the image processing module, checking an element of evidence of the completion of the assignment for repetition of pixels from cloning.
 3. The apparatus of claim 1, wherein verifying the completion of the assignment related to the user comprises, using the image processing module, checking an element of evidence of the completion of the assignment for metadata.
 4. The apparatus of claim 3, wherein checking the element of evidence of the completion of the assignment for metadata comprises checking EXIF data for modifications to the EXIF data.
 5. The apparatus of claim 1, wherein verifying the completion of the assignment related to the user comprises receiving a determination from an inner circle member of a validity of an element of evidence of the completion of the assignment.
 6. The apparatus of claim 5, wherein verifying the completion of the assignment related to the user comprises presenting the evidence of completion of the assignment to the inner circle member.
 7. The apparatus of claim 1, wherein the memory contains instructions further configuring the at least a processor to allow an employer of the user to view the token certificate.
 8. The apparatus of claim 1, wherein the user identifier comprises a public key.
 9. The apparatus of claim 1, wherein the indication comprises a certificate indicating completion of a course related to the assignment.
 10. The apparatus of claim 1, wherein retrieving the user identifier comprises retrieving the user identifier from the immutable sequential listing.
 11. A method for generating a token certificate associated with an assignment, the method comprising: receiving, by at least a processor, an indication of a completion of an assignment related to a user; verifying, by the at least a processor, the completion of the assignment related to the user using an image processing module; and generating, by the at least a processor, a token certificate as a function of the completion of the assignment, wherein generating the token certificate comprises: retrieving a user identifier; and generating the token certificate as a function of the user identifier.
 12. The method of claim 11, wherein verifying the completion of the assignment related to the user comprises, using the image processing module, checking an element of evidence of the completion of the assignment for repetition of pixels from cloning.
 13. The method of claim 11, wherein verifying the completion of the assignment related to the user comprises, using the image processing module, checking an element of evidence of the completion of the assignment for metadata.
 14. The method of claim 13, wherein checking the element of evidence of the completion of the assignment for metadata comprises checking EXIF data for modifications to the EXIF data.
 15. The method of claim 11, wherein verifying the completion of the assignment related to the user comprises receiving a determination from an inner circle member of a validity of an element of evidence of the completion of the assignment.
 16. The method of claim 15, wherein verifying the completion of the assignment related to the user comprises presenting the evidence of completion of the assignment to the inner circle member.
 17. The method of claim 11, further comprising allowing, by the at least a processor, an employer of the user to view the token certificate.
 18. The method of claim 11, wherein the user identifier comprises a public key.
 19. The method of claim 11, wherein the indication comprises a certificate indicating completion of a course related to the assignment.
 20. The method of claim 11, wherein retrieving the user identifier comprises retrieving the user identifier from the immutable sequential listing. 